Critique of Barbosa's "P != NP Proof"

نویسندگان

Jackson Abascal

Shir Maimon

چکیده

We review Andr\'e Luiz Barbosa's paper"P != NP Proof,"in which the classes P and NP are generalized and claimed to be proven separate. We highlight inherent ambiguities in Barbosa's definitions, and show that attempts to resolve this ambiguity lead to flaws in the proof of his main result.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Critique of J. Kim's "P is not equal to NP by Modus Tollens"

This paper is a critique of version three of Joonmo Kim’s paper entitled “P 6= NP by Modus Tollens.” After summarizing Kim’s proof, we note that the logic that Kim uses is inconsistent, which provides evidence that the proof is invalid. To show this, we will consider two reasonable interpretations of Kim’s definitions, and show that “P 6= NP” does not seem to follow in an obvious way using any ...

متن کامل

Barbosa, Uniform Polynomial Time Bounds, and Promises

This note is a commentary on, and critique of, André Luiz Barbosa’s paper entitled “P != NP Proof.” Despite its provocative title, what the paper is seeking to do is not to prove P 6= NP in the standard sense in which that notation is used in the literature. Rather, Barbosa is (and is aware that he is) arguing that a different meaning should be associated with the notation P 6= NP, and he claim...

متن کامل

Critique of Feinstein's Proof that P is not Equal to NP

We examine a proof by Craig Alan Feinstein that P 6= NP . We present counterexamples to claims made in his paper and expose a flaw in the methodology he uses to make his assertions. The fault in his argument is the incorrect use of reduction. Feinstein makes incorrect assumptions about the complexity of a problem based on the fact that there is a more complex problem that can be used to solve i...

متن کامل

A Critique of "Solving the P/NP Problem Under Intrinsic Uncertainty"

Although whether P equals NP is an important, open problem in computer science, and although Jaeger’s 2008 [1] paper, “Solving the P/NP Problem Under Intrinsic Uncertainty” presents an attempt at tackling the problem by discussing the possibility that all computation is uncertain to some degree, there are a number of logical oversights present in that paper which preclude it from serious consid...

متن کامل